Time-Aware Graph Embedding: A Temporal Smoothness and Task-Oriented Approach

نویسندگان

چکیده

Knowledge graph embedding, which aims at learning the low-dimensional representations of entities and relationships, has attracted considerable research efforts recently. However, most knowledge embedding methods focus on structural relationships in fixed triples while ignoring temporal information. Currently, existing time-aware only factual plausibility, smoothness, models interactions between a fact its contexts, thus can capture fine-granularity relationships. This leads to limited performance related applications. To solve this problem, article presents Robustly Time-aware Graph Embedding (RTGE) method by incorporating smoothness. Two major innovations our are presented here. At first, RTGE integrates measure smoothness process embedding. Via proposed additional smoothing factor, preserve both information evolutionary patterns given graph. Secondly, provides general task-oriented negative sampling strategy associated with temporally aware information, further improves adaptive ability algorithm plays an essential role obtaining superior various tasks. Extensive experiments conducted multiple benchmark tasks show that increase entity/relationship/temporal scoping prediction

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GAKE: Graph Aware Knowledge Embedding

Knowledge embedding, which projects triples in a given knowledge base to d-dimensional vectors, has attracted considerable research efforts recently. Most existing approaches treat the given knowledge base as a set of triplets, each of whose representation is then learned separately. However, as a fact, triples are connected and depend on each other. In this paper, we propose a graph aware know...

متن کامل

A Riemannian approach to graph embedding

In this paper, we make use of the relationship between the Laplace-Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. To embark on this study, we review some of the basics of Riemannian geometry and explain the relationship between the Laplace-Beltrami operator and the graph Laplacian. Using the properties of Jacobi fields, we show how t...

متن کامل

LASAGNE: Locality And Structure Aware Graph Node Embedding

Recent work has attempted to identify structure in social and information graphs by using the following approach: first, use random walk methods to explore the neighborhood of a node; second, use ideas from natural language processing to use this neighborhood information to learn vector representations of these nodes reflecting properties of the graph. Informally, the idea is that if a node is ...

متن کامل

the effects of time planning and task complexity on accuracy of narrative task performance

هدف اصلی این تحقیق بررسی تاثیر برنامه ریزی زمانی، هم چنین افزایش میزان پیچیدگی تکالیف در نظر گرفته شده بصورت همزمان، بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 16 الی 18 سال به عنوان شرکت کنندگان در این زمینه ی تحقیق در نظر گرفته شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی هر دو تکلیف ساده و پی...

Architecture-aware Task-scheduling: A thermal approach

Current task-centric many-core schedulers share a “naive” view of processor architecture; a view that does not care about its thermal, architectural or power consuming properties. Future processor will be more heterogeneous than what we see today, and following Moore’s law of transistor doubling, we foresee an increase in power consumption and thus temperature. Thermal stress can induce errors ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Knowledge Discovery From Data

سال: 2021

ISSN: ['1556-472X', '1556-4681']

DOI: https://doi.org/10.1145/3480243